08081 Abstracts Collection -- Data Structures

From February 17th to 22nd 2008, the Dagstuhl Seminar 08081 ``Data Structures\u27\u27 was held in the International Conference and Research Center (IBFI), Schloss Dagstuhl. It brought together 49 researchers from four continents to discuss recent developments concerning data structures in terms of research but also in terms of new technologies that impact how data can be stored, updated, and retrieved. During the seminar a fair number of participants presented their current research. There was discussion of ongoing work, and in addition an open problem session was held. This paper first describes the seminar topics and goals in general, then gives the minutes of the open problem session, and concludes with abstracts of the presentations given during the seminar. Where appropriate and available, links to extended abstracts or full papers are provided

04091 Abstracts Collection -- Data Structures

From 22.02. to 27.02.2004, Dagstuhl Seminar "Data Structures" was held in the International Conference and Research Center (IBFI), Schloss Dagstuhl. During the seminar, several participants presented their current research, and ongoing work and open problems were discussed. Abstracts of the presentations given during the seminar are put together in this paper. The first section describes the seminar topics and goals in general

Improved upper bounds on shellsort

AbstractThe running time of Shellsort, with the number of passes restricted to O(log N), was thought for some time to be Θ(N32), due to general results of Pratt. Sedgewick recently gave an O(N43) bound, but extensions of his method to provide better bounds seem to require new results on a classical problem in number theory. In this paper, we use a different approach to achieve O(N1 + ε√1g N) for any ε0

Digital search trees revisited

Résumé disponible dans les fichiers attaché

The Average case analysis of algorithms : complex asymptotics and generating functions

This report is part of a projected series whose aim is to present in a synthetic way the major methods and models in the average-case analysis of algorithms. The present work - complex asymptotics and generating functions - is devoted to the use of complex analysis in order to estimate the asymptotic growth of coefficients of combinatorial generating functions. It consists of two chapters : complex asymptotic methods - syngularity analysis of generating functions

The Average case analysis of algorithms : counting and generating functions

This report is part of a projected series whose aim is to present in a synthetic way the major methods and models in the average-case analysis of algorithms. The present work (counting and generating functions) introduces a symbolic approach through formal specifications to the analysis of basic combinatorial structures. It consists of three chapters : symbolic enumeration and ordinary generating functions - labelled structures and exponential generating functions - parameters and multivariate generating functions

Analytic combinatorics : functional equations, rational and algebraic functions

This report is part of a series whose aim is to present in a synthetic way the major methods and models in analytic combinatorics. Here, we detail the case of rational and algebraic functions and discuss systematically closure properties, the location of singularities, and consequences regarding combinatorial enumeration. The theory is applied to regular and context-free languages, finite state models, paths in graphs, locally constrained permutati- ons, lattice paths and walks, trees, and planar maps

Practical variations of shellsort

Disponible dans les fichiers attachés à ce documen

Some uses of the Mellin integral transform in the analysis of algorithms

Résumé disponible dans les fichiers attaché